Random Dot Product Graph Models for Social Networks

نویسندگان

  • Stephen J. Young
  • Edward R. Scheinerman
چکیده

Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraetzl, Nickel and Scheinerman, and Tucker [1, 2]. In particular we consider the properties of clustering, diameter and degree distribution with respect to these models. Additionally we explore the conductance of these models and show that in a geometric sense, the conductance is constant.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs

Social networks are often analyzed through a graph model of the network. The dot product model assumes that two individuals are connected in the social network if their attributes or opinions are similar. In the model, a d-dimensional vector a represents the extent to which individual v has each of a set of d attributes or opinions. Then two individuals u and v are assumed to be friends, that i...

متن کامل

Random Dot Product Graphs a Model for Social Networks

We develop a new set of random graph models. The motivation for these models comes from social networks and is based on the idea of common interest. We represent a social network as a graph, in which vertices correspond to individuals. In the general model, an interest vector xv, drawn from a specific distribution, is associated with corresponding vertex v. The edge between vertices u and v exi...

متن کامل

Algorithms for diversity and clustering in social networks through dot product graphs

In this paper, we investigate a graph-theoretical model of social networks. The dot product model assumes that two individuals are connected in the social network if their attributes or opinions are similar. In the model, a d-dimensional vector a represents the extent to which individual v has each of a set of d attributes or opinions. Then two individuals u and v are assumed to be friends, tha...

متن کامل

What Graphs are 2-Dot Product Graphs?

From a set of d-dimensional vectors for some integer d ≥ 1, we obtain a d-dot product graph by letting each vector au correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product au · av ≥ t, for some fixed, positive threshold t. Dot product graphs can be used to model social networks. To understand the position of d-dot product graphs in the land...

متن کامل

On perfectness of dot product graph of a commutative ring

Let $A$ be a commutative ring with nonzero identity, and $1leq n

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007